Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking
نویسندگان
چکیده
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed product is an explicit graph of aggregates (symbolic sets of states) that can be interpreted as a Büchi automaton. The criterion used by SLAP to aggregate states from the Kripke structure is based on the analysis of self-loops that occur in the Büchi automaton expressing the property to verify. Our hybrid approach allows on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the other hand, to have a compact encoding of the state space thanks to the symbolic representation of the aggregates. Our experiments show that this technique often outperforms other existing (hybrid or fully symbolic) approaches.
منابع مشابه
Combining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking
We present two new hybrid techniques that replace the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed products are explicit graphs of aggregates (symbolic sets of states) that can be interpreted as Büchi automata. These hybrid approaches allow on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the ...
متن کاملA hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty
The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...
متن کاملAutomata-theoretic and bounded model checking for linear temporal logic
In this work we study methods for model checking the temporal logic LTL. The focus is on the automata-theoretic approach to model checking and bounded model checking. We begin by examining automata-theoretic methods to model check LTL safety properties. The model checking problem can be reduced to checking whether the language of a finite state automaton on finite words is empty. We describe an...
متن کاملAn Optimization Model for Multi-objective Closed-loop Supply Chain Network under uncertainty: A Hybrid Fuzzy-stochastic Programming Method
In this research, we address the application of uncertaintyprogramming to design a multi-site, multi-product, multi-period,closed-loop supply chain (CLSC) network. In order to make theresults of this article more realistic, a CLSC for a case study inthe iron and steel industry has been explored. The presentedsupply chain covers three objective functions: maximization ofprofit, minimization of n...
متن کاملSaturation-Based Incremental LTL Model Checking with Inductive Proofs
Efficient symbolic and explicit model checking approaches have been developed for the verification of linear time temporal properties. Nowadays, advances resulted in the combination of on-the-fly search with symbolic encoding in a hybrid solution providing many results by now. In this work, we propose a new hybrid approach that leverages the so-called saturation algorithm both as an iteration s...
متن کامل